#include <stdio.h>
#include <stdlib.h>

struct BTNode {
    int data;
    struct BTNode *lChild;
    struct BTNode *rChild;
} *BTree;

struct BTNode *createNode(int key) {
    struct BTNode *node = (struct BTNode *) malloc(sizeof(struct BTNode));
    node->data = key;
    node->lChild = NULL;
    node->rChild = NULL;
    return node;
}

struct BTNode *insert(struct BTNode *root, int key) {
    struct BTNode *node = createNode(key);
    if (root == NULL) {
        root = node;
        return root;
    } else {
        if (key < root->data) {
            root->lChild = insert(root->lChild, key);
        } else if (key > root->data) {
            root->rChild = insert(root->rChild, key);
        } else {
            return root;
        }
    }
}


        int main() {
        }
